Doubly Circular Linked List - Reverse (Recursive).cpp

#include <iostream>
using namespace std;

struct NODE {
    int data;
    NODE *prev;
    NODE *next;
};

NODE *head, *tail, *prevnode, *temp;
void add(int value){
    if(head == NULL){
        head = tail = new NODE;
        head->data = value;
        head->prev = head->next = tail;
    } else {
        prevnode = tail;
        tail->next = head->prev = new NODE;
        tail = tail->next;
        tail->prev = prevnode;
        tail->data = value;
        tail->next = head;
    }
}

NODE *reverseRecursive(NODE *node){
    if(node == 0) return 0;
    if(node->next == head){
        tail = head;
        head = node;
        head->prev = tail;
        return node;
    }
    NODE *reverse = reverseRecursive(node->next);
    node->prev = reverse;
    reverse->next = node;
    node->next = head;
    return node;
}

int print(NODE *ref){
    if(ref == 0){
        cout << "[EMPTY LIST]" << endl;
        return false;
    } else {
        do {
            cout << ref->data;
            ref = ref->next;
            if(ref != head) cout << " => ";
        } while(ref != head);
        cout << endl;
        return true;
    }
}

int main(){
    add(10);
    add(20);
    add(30);
    add(40);
    add(50);

    reverseRecursive(head);
    print(head);
}